Linear maps leaving invariant subsets of nonnegative symmetric matrices
نویسندگان
چکیده
منابع مشابه
Dynamics of piecewise linear maps and sets of nonnegative matrices
We consider maps fK(v) = minA∈K Av and gK(v) = maxA∈KAv, where K is a finite set of nonnegative matrices and by “min” and “max” we mean component-wise minimum and maximum. We transfer known results about properties of gK to fK. In particular we show existence of nonnegative generalized eigenvectors of fK, give necessary and sufficient conditions for existence of strictly positive eigenvector of...
متن کاملOn Reduced Rank Nonnegative Matrix Factorization for Symmetric Nonnegative Matrices
Let V ∈ R be a nonnegative matrix. The nonnegative matrix factorization (NNMF) problem consists of finding nonnegative matrix factors W ∈ R and H ∈ R such that V ≈ WH. Lee and Seung proposed two algorithms which find nonnegative W and H such that ‖V −WH‖F is minimized. After examining the case in which r = 1 about which a complete characterization of the solution is possible, we consider the ca...
متن کاملLinear maps preserving or strongly preserving majorization on matrices
For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...
متن کاملFactoring nonnegative matrices with linear programs
This paper describes a new approach for computing nonnegative matrix factorizations (NMFs) with linear programming. The key idea is a data-driven model for the factorization, in which the most salient features in the data are used to express the remaining features. More precisely, given a data matrix X , the algorithm identifies a matrix C that satisfies X ≈ CX and some linear constraints. The ...
متن کاملDynamics of piecewise linear maps and sets of nonnegative matrices I . Bondarenko December 2 , 2008
We consider functions f v = min A∈K Av and gv = max A∈K Av, where K is a finite set of nonnegative matrices and by " min " and " max " we mean coordinate-wise minimum and maximum. We transfer known results about properties of g to f. In particular we show existence of nonnegative generalized eigenvectors for f , give necessary and sufficient conditions for existence of strictly positive eigenve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2003
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700037618